Big data privacy in the Internet of Things era

Over the last few years, we've seen a plethora of Internet of Things (IoT) solutions, products, and services make their way into the industry's marketplace. All such solutions will capture large amounts of data pertaining to the environment as well as their users. The IoT's objective is to learn more and better serve system users. Some IoT solutions might store data locally on devices ('things'), whereas others might store it in the cloud. The real value of collecting data comes through data processing and aggregation on a large scale, where new knowledge can be extracted. However, such procedures can lead to user privacy issues. This article discusses some of the main challenges of privacy in the IoT as well as opportunities for research and innovation. The authors also introduce some of the ongoing research efforts that address IoT privacy issues

A User-Centric QoS-Aware Multi-Path Service Provisioning in Mobile Edge Computing

Recent development in modern wireless applications and services, such as augmented reality, image processing, and network gaming requires persistent computing on average commercial wireless devices to perform complex tasks with low latency. The traditional cloud systems are unable to meet those requirements solely. In the said perspective, Mobile Edge Computing (MEC) serves as a proxy between the things (devices) and the cloud, pushing the computations at the edge of the network. The MEC provides an effective solution to fulfill the demands of low-latency applications and services by executing most of the tasks within the proximity of users. The main challenge, however, is that too many simultaneous service requests created by wireless access produce severe interference, resulting in a decreased rate of data transmission. In this paper, we made an attempt to overcome the aforesaid limitation by proposing a user-centric QoS-aware multi-path service provisioning approach. A densely deployed base station MEC environment has overlapping coverage regions. We exploit such regions to distribute the service requests in a way that avoid hotspots and bottlenecks. Our approach is adaptive and can tune to different parameters based on service requirements. We performed several experiments to evaluate the effectiveness of our approach and compared it with the traditional Greedy approach. The results revealed that our approach improves the network state by 26.95% and average waiting time by 35.56% as compared to the Greedy approach. In addition, the QoS violations were also reduced by the fraction of 16

Multi-objective scheduling of many tasks in cloud platforms.

h i g h l i g h t s • We propose an ordinal optimized method for multi-objective many-task scheduling. • We prove the suboptimality of the proposed method through mathematical analysis. • Our method significantly reduces scheduling overhead by introducing a rough model. • Our method delivers a set of semi-optimal good-enough scheduling solutions. • We demonstrate the effectiveness of the method on a real-life workload benchmark. a r t i c l e i n f o b s t r a c t The scheduling of a many-task workflow in a distributed computing platform is a well known NP-hard problem. The problem is even more complex and challenging when the virtualized clusters are used to execute a large number of tasks in a cloud computing platform. The difficulty lies in satisfying multiple objectives that may be of conflicting nature. For instance, it is difficult to minimize the makespan of many tasks, while reducing the resource cost and preserving the fault tolerance and/or the quality of service (QoS) at the same time. These conflicting requirements and goals are difficult to optimize due to the unknown runtime conditions, such as the availability of the resources and random workload distributions. Instead of taking a very long time to generate an optimal schedule, we propose a new method to generate suboptimal or sufficiently good schedules for smooth multitask workflows on cloud platforms. Our new multi-objective scheduling (MOS) scheme is specially tailored for clouds and based on the ordinal optimization (OO) method that was originally developed by the automation community for the design optimization of very complex dynamic systems. We extend the OO scheme to meet the special demands from cloud platforms that apply to virtual clusters of servers from multiple data centers. We prove the suboptimality through mathematical analysis. The major advantage of our MOS method lies in the significantly reduced scheduling overhead time and yet a close to optimal performance. Extensive experiments were carried out on virtual clusters with 16 to 128 virtual machines. The multitasking workflow is obtained from a real scientific LIGO workload for earth gravitational wave analysis. The experimental results show that our proposed algorithm rapidly and effectively generates a small set of semi-optimal scheduling solutions. On a 128-node virtual cluster, the method results in a thousand times of reduction in the search time for semi-optimal workflow schedules compared with the use of the Monte Carlo and the Blind Pick methods for the same purpose

Handbook on data centers

This handbook offers a comprehensive review of the state-of-the-art research achievements in the field of data centers. Contributions from international, leading researchers and scholars offer topics in cloud computing, virtualization in data centers, energy efficient data centers, and next generation data center architecture. It also comprises current research trends in emerging areas, such as data security, data protection management, and network resource management in data centers